Suspended Education: Urban Middle Schools in Crisis

Examines the rise in school suspensions; their effectiveness; the widening racial/ethnic discipline gap, especially for African-American boys; and the impact of suspensions on academic success and likelihood of incarceration. Makes policy recommendations

Synchronization-Aware and Algorithm-Efficient Chance Constrained Optimal Power Flow

One of the most common control decisions faced by power system operators is the question of how to dispatch generation to meet demand for power. This is a complex optimization problem that includes many nonlinear, non convex constraints as well as inherent uncertainties about future demand for power and available generation. In this paper we develop convex formulations to appropriately model crucial classes of nonlinearities and stochastic effects. We focus on solving a nonlinear optimal power flow (OPF) problem that includes loss of synchrony constraints and models wind-farm caused fluctuations. In particular, we develop (a) a convex formulation of the deterministic phase-difference nonlinear Optimum Power Flow (OPF) problem; and (b) a probabilistic chance constrained OPF for angular stability, thermal overloads and generation limits that is computationally tractable.Comment: 11 pages, 3 figure

Research Priorities for Robust and Beneficial Artificial Intelligence

Success in the quest for artificial intelligence has the potential to bring unprecedented benefits to humanity, and it is therefore worthwhile to investigate how to maximize these benefits while avoiding potential pitfalls. This article gives numerous examples (which should by no means be construed as an exhaustive list) of such worthwhile research aimed at ensuring that AI remains robust and beneficial.Comment: This article gives examples of the type of research advocated by the open letter for robust & beneficial AI at http://futureoflife.org/ai-open-lette

Polarization analysis of a balloon-borne solar magnetograph

The main text of the report contains the particular results of our research which relate to the Experimental Vector Magnetograph (EXVM) and the Balloon-borne Vector Magnetograph (BVM). A brief overview of which elements in the EXVM and BVM that are relevant to this polarization analysis are presented. The possible meaning of the 10(exp -5) polarization specification for the BVM is discussed qualitatively. A recommendation of which polarization specification is most relevant for the BVM is provided. A diattenuation budget for the various surfaces in the BVM which will allow the polarization specification to be met is discussed. An explanation of the various coating specifications which are recommended is presented. Optical design of the EXVM and coating specification sheets for the BVM are presented. The appendices of this report contain the more general results of our research on the general topic of polarization aberrations. A general discussion of polarization aberration theory, in terms of the SAMEX solar magnetograph, and rigorous derivations for the Mueller matrices of optical systems are also presented in the appendices

The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts

Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a hidden subgroup problem, in which an unknown subgroup $H$ of a group $G$ must be determined from a quantum state $\psi$ over $G$ that is uniformly supported on a left coset of $H$. These hidden subgroup problems are typically solved by Fourier sampling: the quantum Fourier transform of $\psi$ is computed and measured. When the underlying group is nonabelian, two important variants of the Fourier sampling paradigm have been identified: the weak standard method, where only representation names are measured, and the strong standard method, where full measurement (i.e., the row and column of the representation, in a suitably chosen basis, as well as its name) occurs. It has remained open whether the strong standard method is indeed stronger, that is, whether there are hidden subgroups that can be reconstructed via the strong method but not by the weak, or any other known, method. In this article, we settle this question in the affirmative. We show that hidden subgroups $H$ of the $q$-hedral groups, i.e., semidirect products ${\mathbb Z}_q \ltimes {\mathbb Z}_p$, where $q \mid (p-1)$, and in particular the affine groups $A_p$, can be information-theoretically reconstructed using the strong standard method. Moreover, if $|H| = p/ {\rm polylog}(p)$, these subgroups can be fully reconstructed with a polynomial amount of quantum and classical computation. We compare our algorithms to two weaker methods that have been discussed in the literature—the “forgetful” abelian method, and measurement in a random basis—and show that both of these are weaker than the strong standard method. Thus, at least for some families of groups, it is crucial to use the full power of representation theory and nonabelian Fourier analysis, namely, to measure the high-dimensional representations in an adapted basis that respects the group's subgroup structure. We apply our algorithm for the hidden subgroup problem to new families of cryptographically motivated hidden shift problems, generalizing the work of van Dam, Hallgren, and Ip on shifts of multiplicative characters. Finally, we close by proving a simple closure property for the class of groups over which the hidden subgroup problem can be solved efficiently

The Morishima Gross Elasticity of Substitution

We show that the Hotelling-Lau elasticity of substitution, an extension of the Allen-Uzawa elasticity to allow for optimal output-quantity (or utility) responses to changes in factor prices, inherits all of the failings of the Allen-Uzawa elasticity identified by Blackorby and Russell [1989 AER]. An analogous extension of the Morishima elasticity of substitution to allow for output quantity changes preserves the salient properties of the original Hicksian notion of elasticity of substitution.elasticity of substitution ; relative factor shares ; homotheticity